The Mathematical Foundations of Bond Graphs-II. Duality
نویسنده
چکیده
A discussion of duality continues the development of a mathematical theory for bond graphs as combinatorial structures. The dual of a bondgraph is de$ned and its associated vector spaces are the co-spaces of the original bond graph. The relationship between the algebraic structures and their duals is explored. The theory is used to justfy the construction of a simplified bond graph, the proper contraction, which is equivalent to the original bond graph. An inner product is defined and an orthogona:ity theorem between primal and dual vector spaces of a bond graph is proved.
منابع مشابه
The Mathematical Foundations of Bond Graphs-III. Matroid Theory
The cycle and co-cycle matroids of a bond graph are defined using chain group matroids derived,from the cycle and co-cycle vector spaces qf a bond graph. The relationship between these structures is investigated and various results are proved. A precise equivalence is dejined for bond graphs. Duality theory is seen to be very clear in the context of bond graph matroids.
متن کاملThe Mathematical Foundations of Bond Graphs-I. Algebraic Theory
Elementary mathematical concepts from linear algebra are used to develop an independent theory for non-directed bond graphs. The dejinition of a bond graph is given and its structure as a combinatorial object is studied. This is accomplished by constructing a vector space, called the bond space of the bond graph. Topological information is encoded in the bond graph by dejining a subspace of the...
متن کاملThe Mathematical Foundations of Bond Graphs-IV. Matrix Representations and Causality
The development of a mathematical theory for bond graphs continues with an analysis qf two areas crucial to the derivation of system equations,from a bond graph model. Matri.y representations of bond graph matroids ure exumined and used to provide a rigorous proof of the mathematical equivalence sf‘ the linear graph and bond graph modelling methods. The procedure of selecting causality by the m...
متن کاملThe automorphism group of the reduced complete-empty $X-$join of graphs
Suppose $X$ is a simple graph. The $X-$join $Gamma$ of a set ofcomplete or empty graphs ${X_x }_{x in V(X)}$ is a simple graph with the following vertex and edge sets:begin{eqnarray*}V(Gamma) &=& {(x,y) | x in V(X) & y inV(X_x) },\ E(Gamma) &=& {(x,y)(x^prime,y^prime) | xx^prime in E(X) or else x = x^prime & yy^prime in E(X_x)}.end{eqnarray*}The $X-$join graph $Gamma$ is said to be re...
متن کاملOn common neighborhood graphs II
Let G be a simple graph with vertex set V (G). The common neighborhood graph or congraph of G, denoted by con(G), is a graph with vertex set V (G), in which two vertices are adjacent if and only if they have at least one common neighbor in G. We compute the congraphs of some composite graphs. Using these results, the congraphs of several special graphs are determined.
متن کامل